Optimality Conditions for Mathematical Programs with Orthogonality Type Constraints
نویسندگان
چکیده
Abstract We consider the class of mathematical programs with orthogonality type constraints. Orthogonality constraints appear by reformulating sparsity constraint via auxiliary binary variables and relaxing them afterwards. For a necessary optimality condition in terms T-stationarity is stated. The justification threefold. First, it allows to capture global structure Morse theory, i. e. deformation cell-attachment results are established. that, nondegeneracy for T-stationary points introduced shown hold generically. Second, we prove that Karush-Kuhn-Tucker Scholtes-type regularization converge This done under tailored linear independence qualification, which turns out be generic property too. Third, show applied relaxation constrained nonlinear optimization naturally leads its M-stationary points. Moreover, argue all this become degenerate.
منابع مشابه
Second-Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints
We study second-order optimality conditions for mathematical programs with equilibrium constraints (MPEC). Firstly, we improve some second-order optimality conditions for standard nonlinear programming problems using some newly discovered constraint qualifications in the literature, and apply them to MPEC. Then, we introduce some MPEC variants of these new constraint qualifications, which are a...
متن کاملMathematical programs with vanishing constraints: optimality conditions and constraint qualifications
We consider a difficult class of optimization problems that we call a mathematical program with vanishing constraints. Problems of this kind arise in various applications including optimal topology design problems of mechanical structures. We show that some standard constraint qualifications like LICQ and MFCQ usually do not hold at a local minimum of our program, whereas the Abadie constraint ...
متن کاملSecond-order optimality conditions for nonlinear programs and mathematical programs
It is well known that second-order information is a basic tool notably in optimality conditions and numerical algorithms. In this work, we present a generalization of optimality conditions to strongly convex functions of order γ with the help of first- and second-order approximations derived from (Optimization 40(3):229-246, 2011) and we study their characterization. Further, we give an example...
متن کاملNecessary and Sufficient Optimality Conditions for Mathematical Programs with Equilibrium Constraints∗
In this paper we consider a mathematical program with equilibrium constraints (MPEC) formulated as a mathematical program with complementarity constraints. Various stationary conditions for MPECs exist in literature due to different reformulations. We give a simple proof to the M-stationary condition and show that it is sufficient for global or local optimality under some MPEC generalized conve...
متن کاملFirst-Order Optimality Conditions for Elliptic Mathematical Programs with Equilibrium Constraints via Variational Analysis
Mathematical programs in which the constraint set is partially defined by the solutions of an elliptic variational inequality, so-called “elliptic MPECs”, are formulated in reflexive Banach spaces. With the goal of deriving explicit first order optimality conditions amenable to the development of numerical procedures, variational analytic concepts are both applied and further developed. The pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Set-valued and Variational Analysis
سال: 2023
ISSN: ['1877-0541', '1877-0533']
DOI: https://doi.org/10.1007/s11228-023-00673-4